Rational Multi-Agent Search

نویسنده

  • Andreas Blume
چکیده

We study games in which players search for an optimal action profile. All action profiles are either a success, with a payoff of one, or a failure, with a payoff of zero. Players do not know the location of success profiles. Instead each player is privately informed about the marginal distribution of success profiles over his actions. We characterize optimal joint search strategies. ∗ This is a preliminary draft that is currently under construction. We very much appreciate comments. November 4, 2005

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems

This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...

متن کامل

Multi-agent Coordination using Local Search

We consider the problem of coordinating the behavior of multiple self-interested agents. It involves constraint optimization problems that often can only be solved by local search algorithms. Using local search poses problems of incentivecompatibility and individual rationality. We thus define a weaker notion of bounded-rational incentive-compatibility where manipulation is made impossible with...

متن کامل

Socially Rational Models for Autonomous Agents

Autonomous multi-agent systems that are to coordinate must be designed according to models that accommodate such complex social behavior as compromise, negotiation, and altruism. In contrast to individually rational models, where each agent seeks to maximize its own welfare without regard for others, socially rational agents have interests beyond themselves. Such models require a new type of ut...

متن کامل

A review of “ Reasoning About Rational Agents ”

Reasoning About Rational Agents is concerned with developing practical reasoning (as contrasted with theoretical reasoning) for rational computer agents within the “Belief, Desire, Intention” model. The BDI model for computer agents is based on the theory of rational action in humans put forward in 1988 by the philosopher M. Bratman in his book Intention, Plans and Practical Reason. BDI logics ...

متن کامل

Randomization for Multi-agent Constraint Optimization

In a constraint optimization problem for multiple agents, the agents have conflicting preferences in the final solution and the goal is to find an optimal assignment that maximizes total utilities of all agents. Two major challenges when solving constraint optimization problems for multiple agents are the complexity of finding optimal solution and the incentive compatibility for participating a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005